Automatic task graph generation techniques
نویسندگان
چکیده
We present a model of parallel computation, the parameterized task graph, which is a compact, problem size independent, representation of some frequently used directed acylic task graphs. Techniques automating the construction of such a representation, starting from an annotated sequential program are proposed. We show how to represent the computational load for each node and the communication volume for each edge in a problem size independent way. Last, we describe related work and techniques required in order to generate local data structures, computation code and communication code.
منابع مشابه
Automatic Generation of a Multi Agent System for Crisis Management by a Model Driven Approach
Considering the increasing occurrences of unexpected events and the need for pre-crisis planning in order to reduce risks and losses, modeling instant response environments is needed more than ever. Modeling may lead to more careful planning for crisis-response operations, such as team formation, task assignment, and doing the task by teams. A common challenge in this way is that the model shou...
متن کاملOptimizing Cost Function in Imperialist Competitive Algorithm for Path Coverage Problem in Software Testing
Search-based optimization methods have been used for software engineering activities such as software testing. In the field of software testing, search-based test data generation refers to application of meta-heuristic optimization methods to generate test data that cover the code space of a program. Automatic test data generation that can cover all the paths of software is known as a major cha...
متن کاملAutomatic Code Generation for an Asynchronous Task-based Runtime
Hardware scaling considerations associated with the quest for exascale and extreme scale computing are driving system designers to consider event-driven-task (EDT)-oriented execution models for executing on deep hardware hierarchies. Further, for performance, productivity, and code sustainability reasons, there is an increasing demand for autoparallelizing compiler technologies to automatically...
متن کاملAllocation End - to - End Requirements Task Deadlines Task Periods Task Phases Task Code Kernel Library Automatic Code Generation Task Fail Design - to - Implementation Mapping ( Period and Deadline Assignment
In this paper, we present a resource conscious approach to designing distributed real-time systems. This work extends our original solution 6], which was limited to single processor systems. Starting from a given task graph, and a set of end-to-end constraints, we systematically generate task attributes (e.g., periods and deadlines) such that (i) the task set is schedulable, and (ii) the end-to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Parallel Processing Letters
دوره 5 شماره
صفحات -
تاریخ انتشار 1995